[−][src]Crate building_blocks_storage

Various types of storage for "lattice maps," functions defined on N-dimensional integer lattices.

The core storage types are:

Then there are "meta" lattice maps that provide some extra utility:

TransformMap: a wrapper of any kind of lattice map that performs an arbitrary transformation
Fn(&PointN<N>): some lattice map traits are implemented for functions (like SDFs)

Re-exports

pub use access::copy_extent;

pub use access::ForEach;

pub use access::ForEachMut;

pub use access::Get;

pub use access::GetMut;

pub use access::ReadExtent;

pub use access::WriteExtent;

pub use array::Array;

pub use array::ArrayN;

pub use array::FastLz4;

pub use array::Local;

pub use array::Stride;

pub use array2::Array2;

pub use array3::Array3;

pub use chunk_map::Chunk;

pub use chunk_map::Chunk2;

pub use chunk_map::Chunk3;

pub use chunk_map::ChunkMap;

pub use chunk_map::ChunkMap2;

pub use chunk_map::ChunkMap3;

pub use chunk_map::ChunkMapReader;

pub use chunk_map::ChunkMapReader2;

pub use chunk_map::ChunkMapReader3;

pub use chunk_map::LocalChunkCache;

pub use chunk_map::LocalChunkCache2;

pub use chunk_map::LocalChunkCache3;

pub use chunk_map::SerializableChunkMap;

pub use chunk_map::SerializableChunkMap2;

pub use chunk_map::SerializableChunkMap3;

pub use transform_map::TransformMap;

pub use compressible_map;

access	Traits defining different ways to access data from generic lattice maps.
array	N-dimensional arrays, where N is 2 or 3.
array2
array3
chunk_map	A memory-efficient sparse lattice map made of up array chunks.
func	Lattice map access traits implemented for functions and closures.
prelude
transform_map	A lattice map that applies a transformation to another lattice map.

Compressible	A type that's compressible using algorithm `A`.
Decompressible	A type that's decompressible using the inverse of algorithm `A`.
IsEmpty	Used in many generic algorithms to check if a voxel is considered empty.